package leetcode.weekly.week312;

import leetcode.helper.H;

public class Solution4Test extends H {

	public void debug4(Solution4 so) {
		H.compare(10, so.numberOfGoodPaths(this.str2array3("[5,1,4,2,1,5,4,3]"), this.str2array1("[[1,0],[2,0],[3,2],[4,2],[5,4],[6,4],[6,7]]")));
		H.compare(8, so.numberOfGoodPaths(this.str2array3("[1,4,5,2,4,4,1]"), this.str2array1("[[0,1],[1,2],[1,3],[4,2],[5,1],[5,6]]")));
		H.compare(5, so.numberOfGoodPaths(this.str2array3("[2,4,3,1,5]"), this.str2array1("[[0,1],[0,2],[0,3],[2,4]]")));
		H.compare(7, so.numberOfGoodPaths(this.str2array3("[1,1,2,2,3]"), this.str2array1("[[0,1],[1,2],[2,3],[2,4]]")));
		H.compare(6, so.numberOfGoodPaths(this.str2array3("[1,3,2,1,3]"), this.str2array1("[[0,1],[0,2],[2,3],[2,4]]")));
		H.compare(1, so.numberOfGoodPaths(this.str2array3("[1]"), this.str2array1("[]")));
	}

	public void debug3(Solution4 so) {
//		H.compare(so, so);
	}

	public void debug2(Solution4 so) {
//		H.compare(so, so);
	}

	public void debug1(Solution4 so) {
//		H.compare(so, so);
	}

	public static void main(String[] args) {
		Solution4Test test = new Solution4Test();
		Solution4 so = new Solution4();
		test.debug1(so);
		test.debug2(so);
		test.debug3(so);
		test.debug4(so);
	}

}
